Perceptual relativity-based local hyperplane classification
نویسندگان
چکیده
The k-local hyperplane distance nearest neighbors classification (HKNN) builds a non-linear decision surface with maximal local margin in the input space, with invariance inferred from the local neighborhood rather than the prior knowledge, so that it performs very well in many applications. However, it still cannot be comparable with human being in classification on the noisy, the sparse, and fier(RLHC),to overcome this problem by utilizing the perceptual relativity to HKNN. It finds k nearest neighbors for the query sample from each class and then performs the relative transformation over all these nearest neighbors to build the relative space. Subsequently, each local hyperplane is constructed in the relative space, which is then applied to perform the classification. Experimental results on both real and simulated data suggest that the proposed approach often gives the better results in classification and robustness. & 2012 Elsevier B.V. All rights reserved.
منابع مشابه
Image authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کاملAlternating local search based VNS for linear classification
We consider the linear classification method consisting of separating two sets of points in d-space by a hyperplane. We wish to determine the hyperplane which minimises the sum of distances from all misclassified points to the hyperplane. To this end two local descent methods are developed, one grid-based and one optimisation-theory based, and are embedded in several ways into a VNS metaheurist...
متن کاملروشی جدید برای عضویتدهی به دادهها و شناسایی نوفه و دادههای پرت با استفاده از ماشین بردار پشتیبان فازی
Support Vector Machine (SVM) is one of the important classification techniques, has been recently attracted by many of the researchers. However, there are some limitations for this approach. Determining the hyperplane that distinguishes classes with the maximum margin and calculating the position of each point (train data) in SVM linear classifier can be interpreted as computing a data membersh...
متن کاملImproving Chernoff criterion for classification by using the filled function
Linear discriminant analysis is a well-known matrix-based dimensionality reduction method. It is a supervised feature extraction method used in two-class classification problems. However, it is incapable of dealing with data in which classes have unequal covariance matrices. Taking this issue, the Chernoff distance is an appropriate criterion to measure distances between distributions. In the p...
متن کاملTime as an operator/observable in nonrelativistic quantum mechanics
The nonrelativistic Schrödinger equation for motion of a structureless particle in four-dimensional space-time entails a well-known expression for the conserved four-vector field of local probability density and current that are associated with a quantum state solution to the equation. Under the physical assumption that each spatial, as well as the temporal, component of this current is observa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Neurocomputing
دوره 97 شماره
صفحات -
تاریخ انتشار 2012